Financial Planning with 0-1 Knapsack Problems, Part Ii: Using Domination Results to Solve Knapsack Problems

Part II uses domination results in knapsack problems to assist in generating solutions more rapidly and with less work. In particular, domination results are used to: (1) generate smaller problems so that less work is needed to solve the problems, and (2) speed up solution by pruning the variable sets that must be examined. Three solution processes are examined in Part II. Domination resultS are used on branch and bound algorithms, dynamic programming algorithm and epsilon-approximate algorithms. Use of domination concepts can substantially reduce the computational demands of a solution process. Advanees in Mathematical Programming and Financial Planning, Volume 4, pages 151-1". Copyright © 1995 hy JAI Press Ine. AU rights of reproduction in any form reserved. ISBN: 1-55'38-724-6